Representing digraphs using intervals or circular arcs

نویسندگان

  • Malay K. Sen
  • Barun K. Sanyal
  • Douglas B. West
چکیده

Containment and overlap representations of digraphs are studied, with the following results. The interval containment digraphs are the digraphs of Ferrers dimension 2, and the circular-arc containment digraphs are the complements of circular-arc intersection digraphs. A poset is an interval containment poset if and only if its comparability digraph is an interval containment digraph, and a graph is an interval graph if and only if the corresponding symmetric digraph with loops is an interval digraph. In an appropriate model of overlap representation using intervals, the unit right-overlap interval digraphs are precisely the unit interval digraphs, and the adjacency matrices of right-overlap interval digraphs have a simple structural characterization bounding their Ferrers dimension by 3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal Helly circular-arc graphs and its subclasses

A Helly circular-arc modelM = (C,A) is a circle C together with a Helly family A of arcs of C. If no arc is contained in any other, thenM is a proper Helly circular-arc model, if every arc has the same length, then M is a unit Helly circular-arc model, and if there are no two arcs covering the circle, thenM is a normal Helly circular-arc model. A Helly (resp. proper Helly, unit Helly, normal He...

متن کامل

The Minimum Exponent of the Primitive Digraphs on the given Number of Arcs

Primitive digraphs on n vertices, k arcs and girth s are considered. By a(n, k, s) we mean the minimum exponent taken over all such digraphs. We estimate the number a(n, k, s) using the Frobenius number for special values of k and s.

متن کامل

Coarse - fine histograms bimodality analysis of circular

The bimodality of a population P can be measured by dividing its range into two intervals so as to maximize the Fisher distance between the resulting two subpopulations P1 and P2. If P is a mixture of two (approximately) Gaussian subpopulations, then P1 and P2 are good approximations to the original Gaussians, if their Fisher distance if great enough. For a histogram having n bins this method o...

متن کامل

Partially Complemented Representations of Digraphs

A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. This defines an equivalence relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given an adjacency-list representation of a digraph G, many fundamental graph algorithms can be carried out on any...

متن کامل

A Proof-checking Experiment on Representing Graphs as Membership Digraphs

We developed, and computer-checked by means of the Ref verifier, a formal proof that every weakly extensional, acyclic (finite) digraph can be decorated injectively à la Mostowski by finite sets so that its arcs mimic membership. We managed to have one sink decorated with ∅ by this injection. We likewise proved that a graph whatsoever admits a weakly extensional and acyclic orientation; consequ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 147  شماره 

صفحات  -

تاریخ انتشار 1995